Note on Hadamard's Determinant Theorem

نویسنده

  • JOHN WILLIAMSON
چکیده

Introduction. We shall call a square matrix A of order n an Hadamard matrix or for brevity an iî-matrix, if each element of A has the value ± 1 and if the determinant of A has the maximum possible value w. It is known that such a matrix A is an iï-matrix [ l] if, and only if, AA'~nEn where A f is the transpose of A and En is the unit matrix of order n. It is also known that, if an iï-matrix of order n > 1 exists, n must have the value 2 or be divisible by 4. The existence of an iî-matrix of order n has been proved [2,3] only for the following values of n>\\ (a) w = 2, (b) w = £*+ls~0 mod 4, p a prime, (c) n — m(p-\-l) where m ^ 2 is the order of an ü-matrix and p is a prime, (d) n = q(q — l) where q is a product of factors of types (a) and (b), (e) n = 172 and for n a product of any number of factors of types (a), (b), (c), (d) and (e). In this note we shall show that an iï-matrix of order n also exists when (f) n — q(q+3) where q and g+4 are both products of factors of types (a) and (b), (g) n = nin2(p+l)p, where Wi>l and w2>l are orders of i7-matrices and p is an odd prime, and (h) n — nin2in(tn+3) where Wi>l and W2>1 are orders of jff-matrices and m and ra+4 are both of the form p + l, p an odd prime. It is interesting to note the presence of the factors tii and w2 in the types (g) and (h) and their absence in the types (d) and (f).Thus, if p is a prime and £*+ls=0 mod 4, an iJ-matrix of order p(p+l) exists but, if p + l =2 mod 4, we can only be sure of the existence of an iJ-matrix of order nitt2p(p+l) where tii>l and ti2>l are orders of iï-matrices. This is analogous to the simpler result that, iî p + 1^0 mod 4 an ü-matrix of order p + l exists but, if p+lz=2 mod 4, we can only be sure of the existence of an i?-matrix of order n(p+l) where n > 1 is the order of an iï-matrix. We shall denote the direct product of two matrices A and B by A B and the unit matrix of order n by Ew.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Tight is Hadamard's Bound?

CONTENTS For a real square matrix M, Hadamard's inequality gives an up1 . Introduction p e r bound H for the determinant of M; the bound is sharp if and 2. Distribution only if the rows of M are orthogonal. We study how much we 3. Analysis of |d|/H can expect that H overshoots the determinant of M, when the 4. Analysis of Iog(|d|/H) r o w s °f M are chosen randomly on the surface of the sphere....

متن کامل

A Life ' s Work on Hadamard Matrices ,

1 Hadamard matrices in Space Communications One hundred years ago, in 1893, Jacques Hadamard 21] found square matrices of orders 12 and 20, with entries 1, which had all their rows (and columns) orthogonal. These matrices, X = (x ij), satissed the equality of the following inequality jdet Xj 2 n i=1 n X j=1 jx ij j 2 and had maximal determinant. Hadamard actually asked the question of matrices ...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

Lacunary Trigonometric Series. Ii

where E c [0, 1] is any given set o f positive measure and {ak} any given sequence of real numbers. This theorem was first proved by R. Salem and A. Zygmund in case of a -0, where {flk} satisfies the so-called Hadamard's gap condition (cf. [4], (5.5), pp. 264-268). In that case they also remarked that under the hypothesis (1.2) the condition (1.3) is necessary for the validity of (1.5) (cf. [4]...

متن کامل

A simple proof of the Ahlswede - Csiszár one-bit theorem

1983 931 from the second, let K = AA'. Then AA' is nonnegative definite and IAl*=+4'I < jy&L4'),i = n(l&z:.). (1) i j The implication of the second inequality from the first follows from the fact that every nonnegative definite matrix K can be factored as K = AA'. A typical proof of Hadamard's inequality is by induction (see, for example, Bellman [l]) and involves a determinant decomposition fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007